Faster Modulo 2 + 1 Multipliers without Booth Recoding
نویسندگان
چکیده
This paper proposes an improvement to the fastest modulo 2 + 1 multiplier already published, without Booth recoding. Results show that by manipulating the partial products and modulo reduction terms and by inserting them adequately in the multiplication matrix, the performance of multiplication units can be improved more than 20%. This improvement is obtained at the expense of some extra circuit area, which can be disregarded for operands with sufficient length.
منابع مشابه
Efficient VLSI Implementation of Modulo (2 1) Addition and Multiplication
New VLSI circuit architectures for addition and multiplication modulo (2 1) and (2 + 1) are proposed that allow the implementation of highly efficient combinational and pipelined circuits for modular arithmetic. It is shown that the parallel-prefix adder architecture is well suited to realize fast end-around-carry adders used for modulo addition. Existing modulo multiplier architectures are imp...
متن کاملEfficient VLSI Implementation of Modulo 2n 1 Addition and Multiplication
New VLSI circuit architectures for addition and multiplication modulo 2 1 and 2 1 are proposed that allow the implementation of highly efficient combinational and pipelined circuits for modular arithmetic. It is shown that the parallel-prefix adder architecture is well suited to realize fast end-around-carry adders used for modulo addition. Existing modulo multiplier architectures are improved ...
متن کاملEfficient VLSI Implementation of Modulo (2^n=B11) Addition and Multiplication
New VLSI circuit architectures for addition and multiplication modulo (2n 1) and (2n + 1) are proposed that allow the implementation of highly efficient combinational and pipelined circuits for modular arithmetic. It is shown that the parallel-prefix adder architecture is well suited to realize fast end-around-carry adders used for modulo addition. Existing modulo multiplier architectures are i...
متن کاملConfigurable Booth - encoded Modulo 2 n ± 1 Multipliers
Multi-moduli architectures are very useful for reconfigurable digital processors and fault-tolerant systems that utilize the Residue Number System (RNS). In this paper we propose a novel architecture for configurable modulo 2±1 multipliers. It uses the modified Booth encoding of the input operand for deriving the required partial products and an adder tree followed by a sparse parallel-prefix f...
متن کاملOn The Complexity Of Booth Recoding
We formalize and prove the folklore theorems that Booth recoding improves the cost and cycle time of`standard' multipliers by certain constant factors. We also analyze the number of full adders in certain 4/2-trees.
متن کامل